منابع مشابه
Racehorses are getting faster.
Previous studies have concluded that thoroughbred racehorse speed is improving very slowly, if at all, despite heritable variation for performance and putatively intensive selective breeding. This has led to the suggestion that racehorses have reached a selection limit. However, previous studies have been limited, focusing only on the winning times of a few elite races run over middle and long ...
متن کاملGetting the Median Faster
Median filters and rank-order filters are generally considered to be more time consuming than, e.g., averaging filters. With the new algorithm presented in this report the opposite turns out to be true. The median (or any other rank-order value) is obtained by examining the bits of the arguments columnwise starting with the most significant bits. Hardware implementations suitable for parallel p...
متن کاملAre winters getting warmer?
We examine whether any trends in monthly temperatures are the same through-out the year for various lengthy series. The data concern the world, the northern and southern hemispheres, and about three centuries of data for the United Kingdom and the Netherlands. For the empirical exercise, we rely on new and accurate tests which have been recently developed. These tests do not have standard distr...
متن کاملAre babies getting bigger ?
The Medical Journal of Australia ISSN: 0025-729X 16 March 2009 190 6 312315 ©The Medical Journal of Australia 2009 www.mja.com.au Public health the media, with comments such as “. . . the weight of new mothers and babies rockets to record levels . . .”, “Fatter babies mean more c-sections” and “Babies are being born bigger than ever . .”. Increases in birthweight have been reported overseas. In...
متن کاملGetting a Directed Hamilton Cycle Two Times Faster
Consider the random graph process where we start with an empty graph on n vertices, and at time t, are given an edge et chosen uniformly at random among the edges which have not appeared so far. A classical result in random graph theory asserts that whp the graph becomes Hamiltonian at time (1/2+o(1))n log n. On the contrary, if all the edges were directed randomly, then the graph has a directe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biology Letters
سال: 2015
ISSN: 1744-9561,1744-957X
DOI: 10.1098/rsbl.2015.0310